Underspecified quantification

نویسنده

  • Aurélie Herbelot
چکیده

Many noun phrases in text are ambiguously quantified: syntax doesn't explicitly tell us whether they refer to a single entity or to several and, in main clauses, what portion of the set denoted by the subject Nbar actually takes part in the event expressed by the verb. For instance, when we utter the sentence Cats are mammals, it is only world knowledge that allows our hearer to infer that we mean All cats are mammals, and not Some cats are mammals. This ambiguity effect is interesting at several levels. Theoretically, it raises cognitive and linguistic questions. To what extent does syntax help humans resolve the ambiguity? What problem-solving skills come into play when syntax is insufficient for full resolution? How does ambiguous quantification relate to the phenomenon of genericity, as described by the linguistic literature? From an engineering point of view, the resolution of quantificational ambiguity is essential to the accuracy of some Natural Language Processing tasks. We argue that the quantification ambiguity phenomenon can be described in terms of underspecification and propose a formalisation for what we call underquantified subject noun phrases. Our formalisation is motivated by inference requirements and covers all cases of genericity. Our approach is then empirically validated by human annotation experiments. We propose an annotation scheme that follows our theoretical claims with regard to underquan-tification. Our annotation results strengthen our claim that all noun phrases can be analysed in terms of quantification. The produced corpus allows us to derive a gold standard for quantification resolution experiments and is, as far as we are aware, the first attempt to analyse the distribution of null quantifiers in English. We then create a baseline system for automatic quantification resolution, using syntax to provide discriminating features for our classification. We show that results are rather poor for certain classes and argue that some level of pragmatics is needed, in combination with syntax, to perform accurate resolution. We explore the use of memory-based learning as a way to approximate the problem-solving skills available to humans at the level of pragmatic understanding. 3 4 Acknowledgments I would like to thank.... ... my supervisor Dr Ann Copestake, who supported me in more ways than will fit on this page: in particular for mentioning the phenomenon of genericity in the first place, for reading and re-reading countless papers and drafts and always providing the most enlightening comments on my work, for pushing me …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantification, Witness Sets and Conservativity

Theories of semantic scope underspecification can be divided into two types, depending on whether they are based on the notion of satisfaction or on the notion of derivation.1 The central tenet of satisfaction-based theories of scope underspecification is that the relation between a representation SR with fully specified scope relations and a representation UR with underspecified scope relation...

متن کامل

Completeness and Computational Efficiency for Underspecified Representations ∗

Cooper (1983) pioneered underspecified scope representation in formal and computational semantics through his introduction of quantifier storage into Montague semantics as an alternative to the syntactic operation of quantifying-in. In this paper we address an important issue in the development of an adequate formal theory of underspecified semantics. The tension between expressive power and co...

متن کامل

A Notion of Semantic Coherence for Underspecified Semantic Representation

The general problem of finding satisfying solutions to constraint-based underspecified representations of quantifier scope is NP-complete. Existing frameworks, including Dominance Graphs, Minimal Recursion Semantics, and Hole Semantics, have struggled to balance expressivity and tractability, in order to cover real natural language sentences with efficient algorithms. We address this trade-off ...

متن کامل

Towards a redundancy elimination algorithm for underspecified descriptions

Dependency Tree Semantics (DTS) is an underspecified formalism for representing quantifier scope ambiguities in natural language. DTS features a direct interface with a Dependency grammar and an incremental, constraint-based disambiguation mechanism. In this paper, we discuss the meaning of quantifier dependency in DTS by translating its well formed structures into formulae of a Second Order Lo...

متن کامل

NP Coordination in Underspecified Scope Representations

Accurately capturing the quantifier scope behaviour of coordinated NPs can be problematic for some underspecified semantic representations. We present an extension to hole semantics that allows a natural representation of sentences containing NP coordination, and which correctly captures the quantifiers’ scoping behaviour. We demonstrate that existing efficient algorithms developed to solve con...

متن کامل

Factoring Predicate Argument and Scope Semantics: Underspecified Semantics with LTAG

In this paper we propose a compositional semantics for lexicalized tree-adjoining grammar (LTAG). Tree-local multicomponent derivations allow separation of the semantic contribution of a lexical item into one component contributing to the predicate argument structure and a second component contributing to scope semantics. Based on this idea a syntax-semantics interface is presented where the co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010